Generalizations of the General Lotto and Colonel Blotto Games∗
نویسندگان
چکیده
In this paper, we generalize the General Lotto game (budget constraints satisfied in expectation) and the Colonel Blotto game (budget constraints hold with probability one) to allow for battlefield valuations that are heterogeneous across battlefields and asymmetric across players, and for the players to have asymmetric resource constraints. We completely characterize Nash equilibrium in the generalized version of the General Lotto game and then show how this characterization can be applied to identify equilibria in the Colonel Blotto version of the game. In both games, we find that there exist sets of non-pathological parameter configurations of positive Lebesgue measure with multiple payoff nonequivalent equilibria.
منابع مشابه
Discrete Colonel Blotto and General Lotto games
A class of integer-valued allocation games—“General Lotto games”—is introduced and solved. The results are then applied to analyze the classical discrete “Colonel Blotto games”; in particular, optimal strategies are obtained for all symmetric Colonel Blotto games.
متن کاملDiscrete General Lotto games – the non-symmetric case
We provide a complete characterization of optimal strategies for both players in non-symmetric discrete General Lotto games, where one of the players has an advantage over the other. By this we complete the characterization given in Hart [2008], where the strategies for symmetric case were fully characterized and some of the optimal strategies for the non-symmetric case were obtained. Our resul...
متن کاملUniqueness of optimal strategies in Captain Lotto games
We consider the class of two-person zero-sum allocation games known as Captain Lotto games (Hart 2014). These are Colonel Blotto type games in which the players have capacity constraints. We consider the game with non-strict constraints, and with strict constraints. We show in most cases that when optimal strategies exist, they are necessarily unique. When they don’t exist, we characterize the ...
متن کاملFrom Duels to Battlefields: Computing Equilibria of Blotto and Other Games
We study the problem of computing Nash equilibria of zero-sum games. Many natural zerosum games have exponentially many strategies, but highly structured payoffs. For example, in the well-studied Colonel Blotto game (introduced by Borel in 1921), players must divide a pool of troops among a set of battlefields with the goal of winning (i.e., having more troops in) a majority. The Colonel Blotto...
متن کاملAllocation games with caps: from Captain Lotto to all-pay auctions
A Lotto game is a two-person zero-sum game where each player chooses a distribution on nonnegative real numbers with given expectation, so as to maximize the probability that his realized choice is higher than his opponent’s. These games arise in various competitive allocation setups (e.g., contests, research and development races, political campaigns, Colonel Blotto games). A Captain Lotto gam...
متن کامل